A k-order fuzzy OR operator for pattern classification with k-order ambiguity rejection
نویسندگان
چکیده
منابع مشابه
A k-order fuzzy OR operator for pattern classification with k-order ambiguity rejection
In pattern recognition, the membership of an object to classes is often measured by labels. This article mainly deals with the mathematical foundations of labels combination operators, built on t-norms, that extend previous ambiguity measures of objects by dealing not only with 2 classes ambiguities but also with k classes, k lying between 1 and the number of classes c. Mathematical properties ...
متن کاملOrder-Preserving Pattern Matching with k Mismatches
We study a generalization of the order-preserving pattern matching recently introduced by Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to k mismatches between the pattern of leng...
متن کاملCHARACTERIZATIONS OF OPERATOR ORDER FOR k STRICTLY POSITIVE OPERATORS
Let Ai (i = 1,2, · · · ,k) be bounded linear operators on a Hilbert space. This paper aims to show a characterization of operator order Ak Ak−1 · · · A2 A1 > 0 in terms of operator inequalities. Afterwards, an application of the characterization is given to operator equalities due to Douglas’s majorization and factorization theorem. Mathematics subject classification (2010): 47A63.
متن کاملK-winner machines for pattern classification
The paper describes the K-winner machine (KWM) model for classification. KWM training uses unsupervised vector quantization and subsequent calibration to label data-space partitions. A K-winner classifier seeks the largest set of best-matching prototypes agreeing on a test pattern, and provides a local-level measure of confidence. A theoretical analysis characterizes the growth function of a K-...
متن کاملHigher order autocorrelations for pattern classification
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low orders (2 or 3) and small local neighborhoods, due to combinatorial increase in computational costs. In this paper a new method for using these features is presented, which allows the use of autocorrelations of any or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2008
ISSN: 0165-0114
DOI: 10.1016/j.fss.2008.02.019